Universal Gröbner bases of toric ideals of combinatorial neural codes

نویسندگان

چکیده

In the 1970s, O'Keefe and Dostrovsky discovered that certain neurons, called place cells, in an animal's brain are tied to its location within arena. A combinatorial neural code is a collection of $0/1$-vectors which encode patterns co-firing activity among cells. Gross, Obatake, Youngs have recently used techniques from toric algebra study when $0$- $1$-, or $2$-inductively pierced: property allows one reconstruct Venn diagram-like planar figure acts as geometric schematic for patterns. This article examines their work closely by focusing on variety classes codes. particular, we identify universal Gr\"obner bases ideal these

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the universal Gröbner bases of toric ideals of graphs

To any graph G can be associated a toric ideal I G. In this talk some recent joint work with Enrique Reyes and Christos Tatakis will be presented on the toric ideal of a graph. A characterization in graph theoretical terms of the elements of the Graver basis and the universal Gröbner basis of the toric ideal of a graph will be given. The Graver basis is the union of the primitive binomials of t...

متن کامل

Graver Bases and Universal Gröbner Bases for Linear Codes

Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal Gröbner bases can be computed.

متن کامل

Janet Bases of Toric Ideals

In this paper we present a version of the general polynomial involutive algorithm for computing Janet bases specialized to toric ideals. The relevant data structures are Janet trees which provide a very fast search for a Janet divisor. We broach also efficiency issues in view of application of the algorithm presented to computation of toric ideals.

متن کامل

Gröbner bases of ideals invariant under endomorphisms

We introduce the notion of Gröbner S-basis of an ideal of the free associative algebra K〈X〉 over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Gröbner S-bases of the ideal corresponding to the universal enveloping algebra of the free nilpotent of class 2 Lie algebra and of the T-ideal generated by the polynomial identity [x, y, z] = 0, w...

متن کامل

Some Combinatorial Applications of Gröbner Bases

Let IF be a field, V ⊆ IF be a (combinatorially interesting) finite set of points. Several important properties of V are reflected by the polynomial functions on V . To study these, one often considers I(V ), the vanishing ideal of V in the polynomial ring IF[x1, . . . , xn]. Gröbner bases and standard monomials of I(V ) appear to be useful in this context, leading to structural results on V . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Involve

سال: 2021

ISSN: ['1944-4184', '1944-4176']

DOI: https://doi.org/10.2140/involve.2021.14.723